Ela Minimal
نویسنده
چکیده
For every completely positive matrix A, cp-rankA ≥ rankA. Let cp-rankG be the maximal cp-rank of a CP matrix realization of G. Then for every graph G on n vertices, cp-rankG ≥ n. In this paper the graphs G on n vertices for which equality holds in the last inequality, and graphs G such that cp-rankA = rankA for every CP matrix realization A of G, are characterized.
منابع مشابه
Ela the Symmetric Minimal Rank Solution of the Matrix Equation Ax = B and the Optimal Approximation∗
By applying the matrix rank method, the set of symmetric matrix solutions with prescribed rank to the matrix equation AX = B is found. An expression is provided for the optimal approximation to the set of the minimal rank solutions.
متن کاملMore than Content: The Role of English Language Arts Teachers in Students’ Long-Term Knowledge
Measures of teachers’ “value added” to student achievement play an increasingly central role in k-12 teacher policy and practice, in part because they have been shown to predict teachers’ long-term impacts on students’ life outcomes. However, little research has examined variation in the long-term effects of teachers with similar value-added performance. In this study, we investigate variation ...
متن کاملEla Completing Block Hermitian Matrices with Maximal and Minimal Ranks and Inertias
For a Hermitian matrix with its main block diagonal given, this paper shows how to choose the off-diagonal blocks such that the resulting matrix has the maximal and minimal possible ranks and inertias, respectively. Some direct consequences and applications are also given.
متن کاملEla on Determining Minimal Spectrally
A new family of minimal spectrally arbitrary patterns is presented which allow for arbitrary spectrum by using the Nilpotent-Jacobian method introduced in [J.H. Drew, C.R. Johnson, D.D. Olesky, and P. van den Driessche. Spectrally arbitrary patterns.Lin. Alg. and Appl. 308:121137, 2000]. The novel approach here is the use of the Intermediate Value Theorem to avoid finding an explicit nilpotent ...
متن کاملEla Ranges of Sylvester Maps and a Minimal Rank Problem
It is proved that the range of a Sylvester map defined by two matrices of sizes p× p and q × q, respectively, plus matrices whose ranks are bounded above, cover all p× q matrices. The best possible upper bound on the ranks is found in many cases. An application is made to a minimal rank problem that is motivated by the theory of minimal factorizations of rational matrix functions.
متن کاملCommon Core standards widen the opportunity gap
Elementary and middle schoolers in New York state sat for the second round of Common Core tests this week amid boycotts and protests from parents, teachers and principals. The Common Core is a set of academic standards in mathematics and English Language Arts (ELA) meant to prepare students for college and career success. Its advocates argue that such standards are crucial for establishing equa...
متن کامل